Min- k -Cut Coalition Structure Generation on Trust-Utility Relationship Graph

Trust relationships have an important effect on coalition formation. In many real scenarios, agents usually cooperate with others in their trusted social networks to form coalitions. Therefore, the trust value between should constrain utility of forming coalitions when cooperating. At same time, most studies ignore impact number structure. this paper, formation trust-utility relationship is researched. Each node represents agent, and that connect To solve task assignment problem, paper proposes a greedy algorithm which based edge contraction. Under premise ensuring agent’s individually rationality, simulates process through continuous contraction constrains k problem Finally, simulation results show our has great scalability because ability solving structure large-scale agent set. It can meet growing demand for data intensive applications Internet things artificial intelligence era. The quality solution much higher than other algorithms, running time negligible.